WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(15)
  "0" :: [] -(0)-> "A"(14)
  "f" :: ["A"(14) x "A"(6)] -(8)-> "A"(0)
  "g" :: ["A"(9) x "A"(0)] -(9)-> "A"(9)
  "g" :: ["A"(6) x "A"(0)] -(6)-> "A"(6)
  "g" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "nil" :: [] -(0)-> "A"(9)
  "nil" :: [] -(0)-> "A"(6)
  "nil" :: [] -(0)-> "A"(0)
  "nil" :: [] -(0)-> "A"(14)
  "norm" :: ["A"(9)] -(1)-> "A"(0)
  "rem" :: ["A"(0) x "A"(15)] -(15)-> "A"(0)
  "s" :: ["A"(15)] -(15)-> "A"(15)
  "s" :: ["A"(0)] -(0)-> "A"(0)


Cost Free Signatures:
---------------------

  "0" :: [] -(0)-> "A"_cf(0)
  "f" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "g" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "nil" :: [] -(0)-> "A"_cf(0)
  "norm" :: ["A"_cf(0)] -(0)-> "A"_cf(0)
  "rem" :: ["A"_cf(0) x "A"_cf(0)] -(0)-> "A"_cf(0)
  "s" :: ["A"_cf(0)] -(0)-> "A"_cf(0)


Base Constructors:
------------------
  "\"0\"_A" :: [] -(0)-> "A"(1)
  "\"g\"_A" :: ["A"(1) x "A"(0)] -(1)-> "A"(1)
  "\"nil\"_A" :: [] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(1)] -(1)-> "A"(1)